Greedy connectivity of geographically embedded graphs
نویسندگان
چکیده
منابع مشابه
Greedy Connectivity of Geographically Embedded Graphs
We introduce a measure of greedy connectivity for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger th...
متن کاملEccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کاملOn the Connectivity of Graphs Embedded in Surfaces II
Let κmax(Σ) denote the maximum value for the connectivity of any graph which embeds in the topological surface Σ. The connectivity interval for Σ is the set of integers in the interval [1, κmax(Σ)]. Given an integer i in [1, κmax(Σ)] it is a trivial problem to demonstrate that there is a graph Gi with connectivity i which also embeds in Σ. We will say that one can saturate the connectivity inte...
متن کاملOn the Connectivity of Graphs Embedded in Surfaces
In a 1973 paper, Cooke obtained an upper bound on the possible connectivity of a graph embedded in a surface (orientable or nonorientable) of fixed genus. Furthermore, he claimed that for each orientable genus #>0 (respectively, nonorientable genus # >0, # {2) there is a complete graph of orientable genus # (respectively, nonorientable genus # ) and having connectivity attaining his bound. It i...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.016109